Daghoghi’s story in Masnavi Manavi is one of the stories which bewildered the readers but the bewilderment that the poet has times and times refers to is a mystical bewilderment.The poet’s experience and the theme of the story do not look familiar to the reader and it has hidden secrets whose understanding is not possible with our ordinary senses and it is beyond our everyday life experiences.  The internal ambiguity of most events requires commentaries and interpretations in such a way that in order to unveil its mysteries one cannot rely on logic and intellect. This story is an eternal experience which is transmitted through the unconscious and the key to the discovery of the unconscious is the study of its symbols.  In this article attempt is made to give a brief outline of the story and to solve some of its mysteries and complexities.

In this paper the combination of equalization and turbo Decoding is studied. In the iterative Decoding of a product code in block turbo coding system, the equalization process is performed within the iteration loop. This research aims to investigate the decision feedback equalizer (DFE) incorporated in the iterative Decoding. Simulation results show that the more severe channel interference, the more the gain of the combination of DFE and turbo decoder performance compared with the case that using them individually.

Myths and mythical narration have several valences of meaning and as a result their surface and deep-structures can evolve and transform based on the horizon of meaning in every text in each historical period. The narrations of Bibis stories have two structures: an initiation custom of marriage (pagosha) and a religious-based tradition. The myths in the stories of Bibis such as “Bibi Shahr-e Banoo” in Rey and “Bibi Shah Zeinab” in Yazdel region in Kashan, even though originally they may have had the deep-structure of “sacrificing the fairies; ” the recreations of the old narrations and also the form of restructured buildings in the Islamic period can be indicative of the religious experience and its relation to the holy time. Some of the signs of the religious experience and its closeness to the religious matter or at least its tendency towards it are “the quality of being mysterious, ” “feeling of awe, ” and “splendor” which eventually result in the realization of the descriptions of the holy matter. These signs are embodied in the details and structures of the narrations as well as related old constructions.

As other media, computer games convey messages which have tow features: explicit and implicit. Semiologically studying computer games and comparing them with narrative structures, the present study attempts to discover the messages they convey. Therefore we have studied and decoded “Special operation 85” as a semiological text. Results show that the game’s features, as naming, interests and motivations of the engaged people, and the events narrated, all lead the producers to their goals of introducing and publicizing Iranian - Islamic cultural values. Although this feature makes “Special Opreation 85” a unique game, it fails in its attempt to produce a mythical personage in Iranian - Islamic cultural context.

Perpetual coding is a sparse coding method in which coefficients are used in a structured way for coding operations. It has been shown that this method reduces the computational complexity of the random linear network coding method. The purpose of this paper is to articulate a mathematical model to illustrate the performance of perpetual coding, and to show that in a perpetual coding with the presence of an erasure channel the number of linear dependent packet transmissions is highly dependent on a parameter called the width ( ) ω which represents the number of consecutive non-zero coding coefficients present in each coded packet after a pivot element. Then, a mathematical analytical model for the number of transmitted packets is provided, which predicts the number of packets until the second round. Finally, we obtain the probability of the packet’ s Decoding in round k and validate it by simulation. The results show that for low error probability and small (ω ) on the link, overhead value can even reach a number close to 70%. To reduce the transmitter overhead, the ( ) ω value must be selected correctly, and the correct choice of ( ) ω is highly dependent on the probability of channel error. Also, for  5, generation size g  256 and low erasure probability on the link, a destination can receive up to 70% overhead on average. Moreover, by increasing the width, the overhead decreases and for  60 it becomes negligible. We show that our mechanism reduces the delay by 37. 44 percent.